Late Weak Bisimulation for Markov Automata
نویسندگان
چکیده
Markov automata (MA) and weak bisimulation have been proposed by Eisentraut, Hermanns and Zhang in [10]. In this paper we propose early and late semantics of Markovian automata, and then introduce early and late weak bisimulations correspondingly. We show that early weak bisimulation coincides with the weak bisimulation in [10], and late weak bisimulation is strictly coarser. Further, we extend our results to simulations.
منابع مشابه
On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation
Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm that needs to check a polynomial number of linear programming problems encoding weak transitions. It is hence polynomial, but not guaranteed to be strongly polynomial. In this paper we show that for polynomial rational probabilistic automata strong polynomial complexity can be ensured. We further discuss co...
متن کاملMarkov Automata: Deciding Weak Bisimulation by means of non-naively Vanishing States
This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA). For this purpose, different notions of vanishing states (a concept originating from the area of Generalised Stochastic Petri Nets) are defined. In particular, non-näıvely vanishing states are shown to be essential for relating the concepts of (state-based) näıve weak bisimulation and (distribution-based) wea...
متن کاملExpected-Delay-Summing Weak Bisimilarity for Markov Automata
A new weak bisimulation semantics is defined for Markov automata that, in addition to abstracting from internal actions, sums up the expected values of consecutive exponentially distributed delays possibly intertwined with internal actions. The resulting equivalence is shown to be a congruence with respect to parallel composition for Markov automata. Moreover, it turns out to be comparable with...
متن کاملBisimulation for BL-general fuzzy automata
In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...
متن کاملOn the Semantics of Markov Automata
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak bisimulation for such systems and prove that this provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between such systems, a generalisation of reduction barbed congru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1202.4116 شماره
صفحات -
تاریخ انتشار 2012